Ideal versions of some combinatorial results
نویسنده
چکیده
We characterize ideals of subsets of natural numbers for which some versions of Ramsey’s theorem and Schur’s theorem hold. These are similar to generalizations shown by Frankl, Graham and Rödl in [6]. We show that, in some sense, Ramsey’s theorem, theorem of Bolzano-Weierstrass and “monotone subsequence” theorem characterize the same class of ideals.
منابع مشابه
A Comparative Study of the “Ideal Observer” in Meta-ethics and the “Divine Command” Theory
The two theories of “ideal observer” and “divine command” are theories on constructionism and voluntarism. According to the ideal theory, ethical realities are defined based on the attitudes of the assumed ideal observers and the foundation of these theories is formed on negation of the independent ethical realities. Therefore, existence of independent and evident ethical realities based on whi...
متن کاملON IDEALIZED VERSIONS OF Pr 1 ( μ
We obtain an improvement of some coloring theorems from [1], [6], and [2] for the case where the singular cardinal in question has countable cofinality. As a corollary, we obtain an “idealized” version of the combinatorial principle Pr1(μ, μ+, μ+, cf(μ)) that maximizes the indecomposability of the associated ideal.
متن کاملHow the Nonextensivity Parameter Affects Energy Fluctuations
In this article, the effect of the nonextensivity parameter on the energy fluctuations of nonextensive systems is studied in two different versions of the Tsallis statistical mechanics. Once a general expression has been reported for the energy fluctuations in the second version (Tsallis work in 1988), the energy fluctuations of an ideal gas and a harmonic oscillator are studied in the second a...
متن کاملSingle Facility Goal Location Problems with Symmetric and Asymmetric Penalty Functions
Location theory is an interstice field of optimization and operations research. In the classic location models, the goal is finding the location of one or more facilities such that some criteria such as transportation cost, the sum of distances passed by clients, total service time, and cost of servicing are minimized. The goal Weber location problem is a special case of location mode...
متن کاملConsidering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کامل